Optimization Model of Raw Material Selection Process for Complex Industry Based on Improved Sequential Quadratic Programming Algorithm
نویسندگان
چکیده
Abstract Raw materials for industrial production mainly come from nature with wide sources and uneven quality, while requires strictly the materials’ quality their indicators are very mutual coupling. In actual production, unreasonable combination formula often exist in process of raw material selection, impeding improvement efficiency, energy-saving, emission reduction. Unfortunately, research on this issue is currently vacant, so main object paper to address selection formulations production. Based designed logical algorithm improved SQP algorithm, study established batch model calculation perspective optimal formula. Finally, a practical example given demonstrate utility application research.
منابع مشابه
A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
We consider optimization problems with objective and constraint functions that may be nonconvex and nonsmooth. Problems of this type arise in important applications, many having solutions at points of nondifferentiability of the problem functions. We present a line search algorithm for situations when the objective and constraint functions are locally Lipschitz and continuously differentiable o...
متن کاملImproved Optimization Process for Nonlinear Model Predictive Control of PMSM
Model-based predictive control (MPC) is one of the most efficient techniques that is widely used in industrial applications. In such controllers, increasing the prediction horizon results in better selection of the optimal control signal sequence. On the other hand, increasing the prediction horizon increase the computational time of the optimization process which make it impossible to be imple...
متن کاملInterior Point Method based Sequential Quadratic Programming Algorithm with Quadaratic Search for Nonlinear Optimization
The field of constrained nonlinear programming (NLP) has been principally challenging to various gradient based optimization techniques. The Sequential quadratic programming algorithm (SQP) that uses active set strategy in solving quadratic programming (QP) subproblems proves to be efficient in locating the points of local optima. However, its efficient determination of the optimal active set h...
متن کاملSequential Quadratic Programming forLarge - Scale Nonlinear Optimization ?
The sequential quadratic programming (SQP) algorithm has been one of the most successful general methods for solving nonlinear constrained optimization problems. We provide an introduction to the general method and show its relationship to recent developments in interior-point approaches. We emphasize large-scale aspects.
متن کاملAn Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization
We propose a sequential quadratic optimization method for solving nonlinear optimization problems with equality and inequality constraints. The novel feature of the algorithm is that, during each iteration, the primal-dual search direction is allowed to be an inexact solution of a given quadratic optimization subproblem. We present a set of generic, loose conditions that the search direction (i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2022
ISSN: ['1875-6883', '1875-6891']
DOI: https://doi.org/10.1007/s44196-022-00166-6